-
1 isolated vertex
изолированная вершина
—
[Л.Г.Суменко. Англо-русский словарь по информационным технологиям. М.: ГП ЦНИИС, 2003.]Тематики
EN
Англо-русский словарь нормативно-технической терминологии > isolated vertex
-
2 isolated vertex
-
3 isolated vertex
в теории графов - вершина (возможно с петлями), но без инцидентных ей дуг или рёбер. В случае графа без петель это вершина степени 0.Syn:см. тж. graph theoryАнгло-русский толковый словарь терминов и сокращений по ВТ, Интернету и программированию. > isolated vertex
-
4 isolated vertex
т. граф. изолированная вершина (вершина графа, возможно, с петлями, но без входящих и исходящих дуг или ребер)See: -
5 isolated vertex
1) Электроника: изолированный узел2) Вычислительная техника: изолированная вершина -
6 isolated vertex
изолированная вершина, изолированный узел -
7 isolated vertex
English-Russian dictionary of computer science and programming > isolated vertex
-
8 isolated vertex
-
9 isolated vertex
-
10 isolated vertex
———————— -
11 vertex
-
12 vertex
1) вершина (1. наивысшая точка 2. наиболее удалённая от основания точка геометрической фигуры или тела 3. точка пересечения трёх или более граней многогранника 4. точка пересечения двух сторон многоугольника 5. вершина графа, узел графа) || вершинный2) узел схемы; узел цепи3) вертекс ( точка небесной сферы)•- adjacent vertex
- chief vertex
- dangling vertex
- daughter vertex
- drain vertex
- even vertex
- exterior vertex
- final vertex
- graph vertex
- incident vertex
- initial vertex
- inner vertex
- irreducible vertex
- isolated vertex
- mating vertex
- multivalent vertex
- odd vertex
- parent vertex
- pendant vertex
- saturated vertex
- source vertex
- suspended vertex
- terminal vertex
- unsaturated vertex -
13 vertex
I т. граф. - bottom-most vertex
- dangling vertex
- exterior vertex
- incident vertex
- initial vertex
- inner vertex
- isolated vertex
- nonterminal vertex
- open vertex
- out vertex
- terminal vertex IIобщая точка пучка или семейства кривыхEnglish-Russian dictionary of computer science and programming > vertex
-
14 initial vertex
-
15 inner vertex
-
16 изолировання вершина
isolated vertexБольшой англо-русский и русско-английский словарь > изолировання вершина
-
17 изолированная вершина
Большой англо-русский и русско-английский словарь > изолированная вершина
-
18 adjacent vertices
т. граф. смежные вершины (две вершины называются смежными, если существует соединяющее их ребро (в графе) или соединяющая их дуга (в орграфе))Syn:joined vertices, adjacent nodesSee: -
19 graph loop
т. граф. петля графа (ребро графа, исходящее из вершины и возвращающееся в ту же вершину)See: -
20 graph
1) граф2) график || строить график3) диаграмма || чертить диаграмму•- alternating composition graph - arbitrarily transversable graph - derived graph - doubly connected graph - doubly transitive graph - fully connected graph - locally countable graph - locally finite graph - locally restricted graph - log-log graph - partially labeled graph - partially orderable graph - progressively finite graph - regressively finite graph - strictly weak graph - strongly orientable graph - strongly regular graph - strongly rigid graph - strongly singular graph - strongly smooth graph - totally inductive graph - triangleless graph - triply transitive graph - uniquely intersectable graph - uniquely representable graph - weakly disconnected graph
- 1
- 2
См. также в других словарях:
Vertex (graph theory) — For other uses, see Vertex (disambiguation). A graph with 6 vertices and 7 edges where the vertex number 6 on the far left is a leaf vertex or a pendant vertex In graph theory, a vertex (plural vertices) or node is the fundamental unit out of… … Wikipedia
Vertex-transitive graph — In mathematics, a vertex transitive graph is a graph G such that, given any two vertices v1 and v2 of G , there is some automorphism : f : V(G) → V(G) such that : f (v1) = v2. In other words, a graph is vertex transitive if its automorphism group … Wikipedia
Glossary of graph theory — Graph theory is a growing area in mathematical research, and has a large specialized vocabulary. Some authors use the same word with different meanings. Some authors use different words to mean the same thing. This page attempts to keep up with… … Wikipedia
Domatic number — A domatic partition. In graph theory, a domatic partition of a graph G = (V,E) is a partition of V into disjoint sets V1, V2,...,VK such that each Vi is a dominati … Wikipedia
Threshold graph — In graph theory, a threshold graph is a graph that can be constructed from a one vertex graph by repeated applications of the following two operations: #Addition of a single isolated vertex to the graph #Addition of a single dominating vertex to… … Wikipedia
Degree (graph theory) — A graph with vertices labeled by degree In graph theory, the degree (or valency) of a vertex of a graph is the number of edges incident to the vertex, with loops counted twice.[1] The degree of a vertex … Wikipedia
Parity of zero — Zero objects, divided into two equal groups Zero is an even number. In other words, its parity the quality of an integer being even or odd is even. Zero fits the definition of even number : it is an integer multiple of 2, namely 0 × 2. As a… … Wikipedia
Degeneracy (graph theory) — In graph theory, a k degenerate graph is an undirected graph in which every subgraph has a vertex of degree at most k: that is, some vertex in the subgraph touches k or fewer of the subgraph s edges. The degeneracy of a graph is the smallest… … Wikipedia
Minor (graph theory) — In graph theory, an undirected graph H is called a minor of the graph G if H is isomorphic to a graph that can be obtained by zero or more edge contractions on a subgraph of G. The theory of graph minors began with Wagner s theorem that a graph… … Wikipedia
Evenness of zero — The number 0 is even. There are several ways to determine whether an integer is even or odd, all of which indicate that 0 is an even number: it is a multiple of 2, it is evenly divisible by 2, it is surrounded on both sides by odd integers, and… … Wikipedia
Neighbourhood (graph theory) — A graph consisting of 6 vertices and 7 edges For other meanings of neighbourhoods in mathematics, see Neighbourhood (mathematics). For non mathematical neighbourhoods, see Neighbourhood (disambiguation). In graph theory, an adjacent vertex of a… … Wikipedia